The Minor Crossing Number
نویسندگان
چکیده
The minor crossing number of a graph G is defined as the minimum crossing number of all graphs that contain G as a minor. Basic properties of this new invariant are presented. We study topological structure of graphs with bounded minor crossing number and obtain a new strong version of a lower bound based on the genus. We also give a generalization of an inequality of Moreno and Salazar crossing numbers of a graph and its minors.
منابع مشابه
The Minor Crossing Number of Graphs with an Excluded Minor
The minor crossing number of a graph G is the minimum crossing number of a graph that contains G as a minor. It is proved that for every graph H there is a constant c, such that every graph G with no H-minor has minor crossing number at most c|V (G)|.
متن کاملGeneral Lower Bounds for the Minor Crossing Number of Graphs
There are three general lower bound techniques for the crossing numbers of graphs: the Crossing Lemma, the bisection method and the embedding method. In this contribution, we present their adaptations to the minor crossing number. Using the adapted bounds, we improve on the known bounds on the minor crossing number of hypercubes. We also point out relations of the minor crossing number to strin...
متن کاملMinor-monotone crossing number
The minor crossing number of a graph G, mcr(G), is defined as the minimum crossing number of all graphs that contain G as a minor. We present some basic properties of this new minor-monotone graph invariant. We give estimates on mcr for some important graph families using the topological structure of graphs satisfying mcr(G) ≤ k.
متن کاملPlanar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that every graph that excludes a fixed graph as a minor has a planar decomposition with bounded width and a linear number of bags. The crossing number of a graph is ...
متن کاملThe Genus Crossing Number
Pach and Tóth [6] introduced a new version of the crossing number parameter, called the degenerate crossing number, by considering proper drawings of a graph in the plane and counting multiple crossing of edges through the same point as a single crossing when all pairwise crossings of edges at that point are transversal. We propose a related parameter, called the genus crossing number, where ed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 20 شماره
صفحات -
تاریخ انتشار 2006